Design of a Mutual Exclusion and Deadlock Algorithm in PCBSD FreeBSD
نویسندگان
چکیده
— This paper shows the implementation of mutual exclusion in PCBSD-FreeBSD operating systems on SMPng environments, providing solutions to problems like investment priority, priority propagation, interlock, CPU downtime, deadlocks, between other. Mutex Control concept is introduced as a solution to these problems through the integration of the scheduling algorithm of multiple queues fed back and mutexes.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...
متن کاملOn Distributed Dynamic Channel Allocation in Mobile Cellular Networks
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). In this paper, we establish the exact relationship between the two problems. Specifically, we introduce the problem of relaxed mu...
متن کاملDeadlock-Free Information Structure Distributed Mutual Exclusion Algorithms
In the distributed mutual exclusion problem, a set of processes must coordinate their actions so that at any time at most one process may be within its critical section. Information structure distributed mutual exclusion algorithms (ISDME) are instances of a general algorithm which can represent several non-token-based algorithms. This paper introduces a new deadlock-free ISDME algorithm (DF-IS...
متن کاملA Simulation Study on Distributed Mutual Exclusion
In the problem of mutual exclusion concurrent access to a shared resource using a struc tural program abstraction called a Critical Section CS must be synchronized such that at any time only one process can enter the CS In a distributed system due to the lack of both a shared memory and a global clock and due to unpredictable message delay the design of a distributed mutual exclusion algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJIMAI
دوره 3 شماره
صفحات -
تاریخ انتشار 2014